Convergence analysis of a domain decomposition paradigm

Convergence Analysis of a Domain Decomposition Paradigm

We describe a domain decomposition algorithm for use in several variants of the parallel adaptive meshing paradigm of Bank and Holst. This algorithm has low communication, makes extensive use of existing sequential solvers, and exploits in several important ways data generated as part of the adaptive meshing paradigm. We show that for an idealized version of the algorithm, the rate of convergen...

A domain decomposition convergence for elasticity equations

A non-overlapping domain decomposition method for elasticity equations based on an optimal control formulation is presented. The existence of a solution is proved and the convergence of a subsequence of the approximate solutions to a solution of the continuous problem is shown. The implementation based on lagrangian method is discussed. Finally, numerical results showing the efficiency of our a...

Convergence rate analysis of domain decomposition methods for obstacle problems

Output-only Modal Analysis of a Beam Via Frequency Domain Decomposition Method Using Noisy Data

The output data from a structure is the building block for output-only modal analysis. The structure response in the output data, however, is usually contaminated with noise. Naturally, the success of output-only methods in determining the modal parameters of a structure depends on noise level. In this paper, the possibility and accuracy of identifying the modal parameters of a simply supported...

Optimized Overlapping Domain Decomposition: Convergence Proofs

During the last two decades many domain decomposition algorithms have been constructed and lot of techniques have been developed to prove the convergence of the algorithms at the continuous level. Among the techniques used to prove the convergence of classical Schwarz algorithms, the first technique is the maximum principle used by Schwarz. Adopting this technique M. Gander and H. Zhao proved a...